2 7 Ju n 20 05 Integrability of graph combinatorics via random walks and heaps of dimers
نویسندگان
چکیده
We investigate the integrability of the discrete non-linear equation governing the dependence on geodesic distance of planar graphs with inner vertices of even valences. This equation follows from a bijection between graphs and blossom trees and is expressed in terms of generating functions for random walks. We construct explicitly an infinite set of conserved quantities for this equation, also involving suitable combinations of random walk generating functions. The proof of their conservation, i.e. their eventual independence on the geodesic distance, relies on the connection between random walks and heaps of dimers. The values of the conserved quantities are identified with generating functions for graphs with fixed numbers of external legs. Alternative equivalent choices for the set of conserved quantities are also discussed and some applications are presented.
منابع مشابه
Integrability of exit times and ballisticity for random walks in Dirichlet environment
We consider random walks in Dirichlet random environment. Since the Dirichlet distribution is not uniformly elliptic, the annealed integrability of the exit time out of a given finite subset is a non-trivial question. In this paper we provide a simple and explicit equivalent condition for the integrability of Green functions and exit times on any finite directed graph. The proof relies on a quo...
متن کاملar X iv : m at h / 05 06 34 6 v 1 [ m at h . G R ] 1 7 Ju n 20 05 COMPUTATIONAL EXPLORATIONS IN THOMPSON ’ S GROUP F
Here we describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult question whether or not Thompson's group is amenable. We also describe experiments to estimate the exponential growth rate of F and the rate of escape of symme...
متن کاملCoassociative Grammar, Periodic Orbits, and Quantum Random Walk over Z
Motivated by the success of classical random walks and chaotic dynamical systems, we study the quantisation of the random walk over Z and its relationships with a classical chaotic system x → 2xmod1, x ∈ [0,1]. In the physics literature, quantum random walks have been studied, for instance, by Ambainis et al. [1] and Konno et al. [8, 9]. In [8], Konno shows that the quantum random walk over Z c...
متن کاملCoassociative grammar, periodic orbits, and quantum random walk over ℤ
Motivated by the success of classical random walks and chaotic dynamical systems, we study the quantisation of the random walk over Z and its relationships with a classical chaotic system x → 2xmod1, x ∈ [0,1]. In the physics literature, quantum random walks have been studied, for instance, by Ambainis et al. [1] and Konno et al. [8, 9]. In [8], Konno shows that the quantum random walk over Z c...
متن کاملExtremal and Probabilistic Combinatorics
09:20 – 09:30 Opening remarks 09:30 – 10:00 Dhruv Mubayi Quasirandom hypergraphs 10:05 – 10:35 Yufei Zhao Sparse regularity and counting in pseudorandom graphs 10:35 – 11:15 Coffee 11:15 – 11:45 Asaf Shapira Exact bounds for some hypergraph saturation problems 11:50 – 12:20 Po-Shen Loh Computing with voting trees 12:20 – 14:30 Lunch 14:30 – 15:00 Joel Spencer Six standard deviations still suffi...
متن کامل